Structured coalgebras and minimal HD-automata for the pi-calculus

نویسندگان

  • Ugo Montanari
  • Marco Pistore
چکیده

This report has been submitted forr publication outside of ITC and will probably be copyrighted if accepted for publication. It has been issued as a Technical Report forr early dissemination of its contents. In view of the transfert of copy right too the outside publisher, its distribution outside of ITC priorr to publication should be limited to peer communications and specificc requests. After outside publication, material will be available only inn the form authorized by the copyright owner.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coalgebraic Minimisation of HD-Automata for the π-Calculus in a Polymorphic λ-Calculus

We give a formal definition of HD-automata based on coalgebras. Exploiting such definition we formally specify and implement a minimisation algorithm for HD-automata derived from π-calculus agents. The algorithm is a generalisation of the partition refinement algorithm for classical automata and is specified as a coalgebraic construction defined using λ ∏ , a polymorphic λ-calculus with depende...

متن کامل

Coalgebraic minimization of HD-automata for the Pi-calculus using polymorphic types

We introduce finite-state verification techniques for the π-calculus whose design and correctness are justified coalgebraically. In particular, we formally specify and implement a minimisation algorithm for HD-automata derived from π-calculus agents. The algorithm is a generalisation of the partition refinement algorithm for classical automata and is specified as a coalgebraic construction defi...

متن کامل

History-Dependent Automata

In this paper we present history-dependent automata (HD-automata in brief). They are an extension of ordinary automata that overcomes their limitations in dealing with history-dependent formalisms. In a history-dependent formalism the actions that a system can perform carry information generated in the past history of the system. The most interesting example is -calculus: channel names can be c...

متن کامل

About permutation algebras and sheaves ( and named sets , too ! ) ∗

In recent years, many general presentations (metamodels) for calculi dealing with names, e.g. process calculi with name-passing, have been proposed. (Pre)sheaf categories have been proved to satisfy classical properties on the existence of initial algebras/final coalgebras. Named sets are a theory of sets with permutations, introduced as the basis for the operational model of HD-automata. Permu...

متن کامل

On Minimal Coalgebras

We define an out-degree for F -coalgebras and show that the coalgebras of outdegree at most κ form a covariety. As a subcategory of all F coalgebras, this class has a terminal object, which for many problems can stand in for the terminal F -coalgebra, which need not exist in general. As examples, we derive structure theoretic results about minimal coalgebras, showing that, for instance minimiza...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 340  شماره 

صفحات  -

تاریخ انتشار 2005